Design and optimization of joint iterative detection and decoding receiver for uplink polar coded SCMA system

SCMA and polar coding are possible candidates for 5G systems. In this paper, we firstly propose the joint iterative detection and decoding (JIDD) receiver for the uplink polar coded sparse code multiple access (PC-SCMA) system. Then, the EXIT chart is used to investigate the performance of the JIDD receiver. Additionally, we optimize the system design and polar code construction based on the EXIT chart analysis. The proposed receiver integrates the factor graph of SCMA detector and polar soft-output decoder into a joint factor graph, which enables the exchange of messages between SCMA detector and polar decoder iteratively. Simulation results demonstrate that the JIDD receiver has better BER performance and lower complexity than the separate scheme. Specifically, when polar code length N=256 and code rate R=1/2 , JIDD outperforms the separate scheme 4.8 and 6 dB over AWGN channel and Rayleigh fading channel, respectively. It also shows that, under 150% system loading, the JIDD receiver only has 0.3 dB performance loss compared to the single user uplink PC-SCMA over AWGN channel and 0.6 dB performance loss over Rayleigh fading channel

On-Line Monitoring and Fault Diagnosis of Box Transformer Substation Based on VPRS-RBFNN

Box transformer substation (BTS) is an important power distribution environment. To ensure the safe and stable operation of the power distribution system, it is critical to monitor the BTS operation and diagnose its faults in a reliable manner. In the Internet of Things (IoT) environment, this paper aims to develop a real-time and accurate online strategy for BTS monitoring and fault diagnosis. The framework of our strategy was constructed based on the IoT technique, including a sensing layer, a network layer and an application layer. On this basis, a BTS fault diagnosis method was established with variable precision rough set (VPRS) as the pre-network and the radial basis function neural network (RBFNN) as the back-fed network. The VPRS and the RBFNN were selected, because the BTS faults have many characteristic parameters, with complex nonlinear relationship with fault modes. Finally, a prototype of our strategy was developed and applied to the fault diagnosis of an actual BTS. The results fully demonstrate the effectiveness and feasibility of our strategy

Discussion on Electrical Design of Passive Residential Building

As the national buildings in each climate zone and passive low energy consumption building demonstration projects expand, there has been a wave of innovation across the construction industry. China is also becoming a hot zone for energy-efficient and high-performance passive buildings. Along with the traditional passive building structure, steel structure passive construction, assembled PC structure passive construction such as the emergence of various types of passive construction, as well as a variety of new building materials, doors and Windows, and air conditioning air equipment, put forward a new challenge for building electrical engineering design personnel and requirements

Mining the candidate genes of rice panicle traits via a genome-wide association study

Panicle traits are important for improving the panicle architecture and grain yield of rice. Therefore, we performed a genome-wide association study (GWAS) to analyze and determine the genetic determinants of five panicle traits. A total of 1.29 million single nucleotide polymorphism (SNP) loci were detected in 162 rice materials. We carried out a GWAS of panicle length (PL), total grain number per panicle (TGP), filled grain number per panicle (FGP), seed setting rate (SSR) and grain weight per panicle (GWP) in 2019, 2020 and 2021. Four quantitative trait loci (QTLs) for PL were detected on chromosomes 1, 6, and 9; one QTL for TGP, FGP, and GWP was detected on chromosome 4; two QTLs for FGP were detected on chromosomes 4 and 7; and one QTL for SSR was detected on chromosome 1. These QTLs were detected via a general linear model (GLM) and mixed linear model (MLM) in both years of the study period. In this study, the genomic best linear unbiased prediction (BLUP) method was used to verify the accuracy of the GWAS results. There are nine QTLs were both detected by the multi-environment GWAS method and the BLUP method. Moreover, further analysis revealed that three candidate genes, LOC_Os01g43700, LOC_Os09g25784, and LOC_Os04g47890, may be significantly related to panicle traits of rice. Haplotype analysis indicated that LOC_Os01g43700 and LOC_Os09g25784 are highly associated with PL and that LOC_Os04g47890 is highly associated with TGP, FGP, and GWP. Our results offer essential genetic information for the molecular improvement of panicle traits. The identified candidate genes and elite haplotypes could be used in marker-assisted selection to improve rice yield through pyramid breeding

Chemiluminescence determination of surfactant Triton X-100 in environmental water with luminol-hydrogen peroxide system

<p>Abstract</p> <p>Background</p> <p>The rapid, simple determination of surfactants in environmental samples is essential because of the extensive use and its potential as contaminants. We describe a simple, rapid chemiluminescence method for the direct determination of the non-ionic surfactant Triton X-100 (polyethylene glycol tert-octylphenyl ether) in environmental water samples. The optimized experimental conditions were selected, and the mechanism of the Luminol-H₂O₂-Triton X-100 chemiluminesence system was also studied.</p> <p>Results</p> <p>The novel chemiluminescence method for the determination of non-ionic surfactant Triton X-100 was based on the phenomenon that Triton X-100 greatly enhanced the CL signal of the luminol-H₂O₂system. The alkaline medium of luminol and the pH value obviously affected the results. Luminol concentration and hydrogen peroxide concentration also affected the results. The optimal conditions were: Na₂CO₃being the medium, pH value 12.5, luminol concentration 1.0 × 10^-4mol L^-1, H₂O₂concentration 0.4 mol L^-1. The possible mechanism was studied and proposed.</p> <p>Conclusion</p> <p>Under the optimal conditions, the standard curve was drawn up and quotas were evaluated. The linear range was 2 × 10^-4g·mL^-1-4 × 10^-2g·mL^-1(w/v), and the detection limit was 3.97 × 10^-5g·mL^-1Triton X-100 (w/v). The relative standard deviation was less than 4.73% for 2 × 10^-2g·mL^-1(w/v) Triton X-100 (n = 7). This method has been applied to the determination of Triton X-100 in environmental water samples. The desirable recovery ratio was between 96%–102% and the relative standard deviation was 2.5%–3.3%. The luminescence mechanism was also discussed in detail based on the fluorescence spectrum and the kinetic curve, and demonstrated that Triton X-100-luminol-H₂O₂was a rapid reaction.</p

Décodeurs Haute Performance et Faible Complexité pour les codes LDPC Binaires et Non-Binaires

This thesis is dedicated to the study of iterative decoders, both for binary and non-binary low density parity check (LDPC) codes. The objective is to design low complexity and low latency decoders which have good performance in the error floor region.In the first part of the thesis, we study the recently introduced finite alphabet iterative decoders (FAIDs). Using the large number of FAIDs, we propose a decoding diversity algorithm to improve the error correction capability for binary LDPC codes with variable node degree 3 over binary symmetric channel. The decoder diversity framework allows to solve the problem of guaranteed error correction with iterative decoding, beyond the pseudo-distance of the LDPC codes. We give a detailed example of a set of FAIDs which corrects all error patterns of weight 7 or less on a (N=155,K=64,Dmin=20) short structured LDPC, while traditional decoders (BP, min-sum) fail on 5-error patterns. Then by viewing the FAIDs as dynamic systems, we analyze the behaviors of FAID decoders on chosen problematic error patterns. Based on the observation of approximate periodic trajectories for the most harmful error patterns, we propose an algorithm which combines decoding diversity with random jumps in the state-space of the iterative decoder. We show by simulations that this technique can approach the performance of Maximum LikelihoodDecoding for several codes.In the second part of the thesis, we propose a new complexity-reduced decoding algorithm for non-binary LDPC codes called trellis extended min sum (T-EMS). By transforming the message domain to the so-called delta domain, we are able to choose row-wise deviations from the most reliable configuration, while usual EMS-like decoders choose the deviations column-wise. This feature of selecting the deviations row-wise enables us to reduce the decoding complexity without any performance loss compared to EMS. We also propose to add an extra column to the trellis representation of the messages, which solves the latency issue of existing decoders. The extra column allows to compute all extrinsic messages in parallel, with a proper hardware implementation. Both the parallel and the serial hardware architectures for T-EMS are discussed. The complexity analysis shows that the T-EMS is especially suitable for high ratenon-binary LDPC codes on small and moderate fields.Cette thèse se consacre à l'étude de décodeurs itératifs, pour des codes correcteurd'erreurs binaires et non-binaires à faible densité (LDPC). Notre objectif est de modéliserdes décodeurs de complexité faibles et de faible latence tout en garantissantde bonne performances dans la région des très faibles taux d'erreur (error floor).Dans la première partie de cette thèse, nous étudions des décodeurs itératifssur des alphabets finis (Finite Alphabet iterative decoders, FAIDs) qui ont étérécemment proposés dans la littérature. En utilisant un grand nombre de décodeursFAIDs, nous proposons un nouvel algorithme de décodage qui améliore la capacité decorrections d'erreur des codes LDPC de degré dv = 3 sur canal binaire symétrique.La diversité des décodeurs permet de garantir une correction d'erreur minimale sousdécodage itératif, au-delà de la pseudo-distance des codes LDPC. Nous donnonsdans cette thèse un exemple detailé d'un ensemble de décodeur FAIDs, qui corrigetous les évènements d'erreur de poids inférieur ou égal à 7 avec un LDPC de petitetaille (N=155,K=64,Dmin=20). Cette approche permet de corriger des évènementsd'erreur que les décodeurs traditionnels (BP, min-sum) ne parviennent pas à corriger.Enfin, nous interprétons les décodeurs FAIDs comme des systèmes dynamiques etnous analysons les comportements de ces décodeurs sur des évènements d'erreur lesplus problématiques. En nous basant sur l'observation des trajectoires périodiquespour ces cas d'étude, nous proposons un algorithme qui combine la diversité dudécodage avec des sauts aléatoires dans l'espace d'état du décodeur itératif. Nousmontrons par simulations que cette technique permet de s'approcher des performancesd'un décodage optimal au sens du maximum de vraisemblance, et ce pourplusieurs codes.Dans la deuxième partie de cette thèse, nous proposons un nouvel algorithmede décodage à complexité réduite pour les codes LDPC non-binaires. Nous avonsappellé cet algorithme Trellis-Extended Min-Sum (T-EMS). En transformant le domainede message en un domaine appelée domaine delta, nous sommes capable dechoisir les déviations ligne par ligne par rapport à la configuration la plus fiable,tandis que les décodeurs habituels comme le décodeur EMS choisissent les déviationscolonne par colonne. Cette technique de sélection des déviations ligne parligne nous permet de réduire la complexité du décodage sans perte de performancepar rapport aux approches du type EMS. Nous proposons également d'ajouter une colonne supplémentaire à la représentation en treillis des messages, ce qui résoudle problème de latence des décodeurs existants. La colonne supplémentaire permetde calculer tous les messages extrinséque en parallèle, avec une implémentationmatérielle dédiée. Nous présentons dans ce manuscrit, aussi bien les architecturesmatérielles parallèle que les architectures matérielles série pour l'exécution de notrealgorithme T-EMS. L'analyse de la complexité montre que l'approche T-EMS estparticulièrement adapté pour les codes LDPC non-binaires sur des corps finis deGalois de petite et moyenne dimensions

High Performance and Low Complexity Decoders for Binary and Non-Binary LDPC Codes

Cette thèse se consacre à l'étude de décodeurs itératifs, pour des codes correcteurd'erreurs binaires et non-binaires à faible densité (LDPC). Notre objectif est de modéliserdes décodeurs de complexité faibles et de faible latence tout en garantissantde bonne performances dans la région des très faibles taux d'erreur (error floor).Dans la première partie de cette thèse, nous étudions des décodeurs itératifssur des alphabets finis (Finite Alphabet iterative decoders, FAIDs) qui ont étérécemment proposés dans la littérature. En utilisant un grand nombre de décodeursFAIDs, nous proposons un nouvel algorithme de décodage qui améliore la capacité decorrections d'erreur des codes LDPC de degré dv = 3 sur canal binaire symétrique.La diversité des décodeurs permet de garantir une correction d'erreur minimale sousdécodage itératif, au-delà de la pseudo-distance des codes LDPC. Nous donnonsdans cette thèse un exemple detailé d'un ensemble de décodeur FAIDs, qui corrigetous les évènements d'erreur de poids inférieur ou égal à 7 avec un LDPC de petitetaille (N=155,K=64,Dmin=20). Cette approche permet de corriger des évènementsd'erreur que les décodeurs traditionnels (BP, min-sum) ne parviennent pas à corriger.Enfin, nous interprétons les décodeurs FAIDs comme des systèmes dynamiques etnous analysons les comportements de ces décodeurs sur des évènements d'erreur lesplus problématiques. En nous basant sur l'observation des trajectoires périodiquespour ces cas d'étude, nous proposons un algorithme qui combine la diversité dudécodage avec des sauts aléatoires dans l'espace d'état du décodeur itératif. Nousmontrons par simulations que cette technique permet de s'approcher des performancesd'un décodage optimal au sens du maximum de vraisemblance, et ce pourplusieurs codes.Dans la deuxième partie de cette thèse, nous proposons un nouvel algorithmede décodage à complexité réduite pour les codes LDPC non-binaires. Nous avonsappellé cet algorithme Trellis-Extended Min-Sum (T-EMS). En transformant le domainede message en un domaine appelée domaine delta, nous sommes capable dechoisir les déviations ligne par ligne par rapport à la configuration la plus fiable,tandis que les décodeurs habituels comme le décodeur EMS choisissent les déviationscolonne par colonne. Cette technique de sélection des déviations ligne parligne nous permet de réduire la complexité du décodage sans perte de performancepar rapport aux approches du type EMS. Nous proposons également d'ajouter une colonne supplémentaire à la représentation en treillis des messages, ce qui résoudle problème de latence des décodeurs existants. La colonne supplémentaire permetde calculer tous les messages extrinséque en parallèle, avec une implémentationmatérielle dédiée. Nous présentons dans ce manuscrit, aussi bien les architecturesmatérielles parallèle que les architectures matérielles série pour l'exécution de notrealgorithme T-EMS. L'analyse de la complexité montre que l'approche T-EMS estparticulièrement adapté pour les codes LDPC non-binaires sur des corps finis deGalois de petite et moyenne dimensions.This thesis is dedicated to the study of iterative decoders, both for binary and non-binary low density parity check (LDPC) codes. The objective is to design low complexity and low latency decoders which have good performance in the error floor region.In the first part of the thesis, we study the recently introduced finite alphabet iterative decoders (FAIDs). Using the large number of FAIDs, we propose a decoding diversity algorithm to improve the error correction capability for binary LDPC codes with variable node degree 3 over binary symmetric channel. The decoder diversity framework allows to solve the problem of guaranteed error correction with iterative decoding, beyond the pseudo-distance of the LDPC codes. We give a detailed example of a set of FAIDs which corrects all error patterns of weight 7 or less on a (N=155,K=64,Dmin=20) short structured LDPC, while traditional decoders (BP, min-sum) fail on 5-error patterns. Then by viewing the FAIDs as dynamic systems, we analyze the behaviors of FAID decoders on chosen problematic error patterns. Based on the observation of approximate periodic trajectories for the most harmful error patterns, we propose an algorithm which combines decoding diversity with random jumps in the state-space of the iterative decoder. We show by simulations that this technique can approach the performance of Maximum LikelihoodDecoding for several codes.In the second part of the thesis, we propose a new complexity-reduced decoding algorithm for non-binary LDPC codes called trellis extended min sum (T-EMS). By transforming the message domain to the so-called delta domain, we are able to choose row-wise deviations from the most reliable configuration, while usual EMS-like decoders choose the deviations column-wise. This feature of selecting the deviations row-wise enables us to reduce the decoding complexity without any performance loss compared to EMS. We also propose to add an extra column to the trellis representation of the messages, which solves the latency issue of existing decoders. The extra column allows to compute all extrinsic messages in parallel, with a proper hardware implementation. Both the parallel and the serial hardware architectures for T-EMS are discussed. The complexity analysis shows that the T-EMS is especially suitable for high ratenon-binary LDPC codes on small and moderate fields

Tunable smart digital structure (SDS) to modularly assemble soft actuators with layered adhesive bonding

Many shape memory alloy (SMA)-based soft actuators have specific composite structures and manufacture processes, and are therefore unique. However, these exclusive characteristics limit their capabilities and applications, so in this article a soft and smart digital structure (SDS) is proposed that acts like a modular unit to assemble soft actuators by a layered adhesive bonding process. The SDS is a fully soft structure that encapsulates a digital skeleton consisting of four groups of parallel and independently actuated SMA wires capable of outputting a four-channel tunable force. The layered adhesive bonding process modularly bonds several SDSs with an elastic backbone to fabricate a layered soft actuator where the elastic backbone is used to recover the SDSs in a cooling process using the SMA wires. Two kinds of SDS-based soft actuators were modularly assembled, an actuator, SDS-I, with a two-dimensional reciprocal motion, and an actuator, SDS-II, capable of bi-directional reciprocal motion. The thermodynamics and phase transformation modeling of the SDS-based actuator were analyzed. Several extensional soft actuators were also assembled by bonding the SDS with an anomalous elastic backbone or modularly assembling the SDS-Is and SDS-IIs. These modularly assembled soft actuators delivered more output channels and a complicated motion, e.g., an actinomorphic soft actuator with four SDS-Is jumps in a series of hierarchical heights and directional movement by tuning the input channels of the SDSs. This result showed that the SDS can modularly assemble multifarious soft actuators with diverse capabilities, steerability and tunable outputs

Behavior-Based Pricing of Organic and Conventional Agricultural Products Based on Green Subsidies

This study considers two types of consumers: those without preference difference, and those that prefer organic agricultural products. It constructs two two-stage hoteling behavior-based pricing models and solves for the optimal loyalty price and poaching price of the two types of enterprises. It analyzes the influence of subsidies on the pricing of the two types of products and corporate profits. The study also undertakes numerical simulation for further analysis, finding that green subsidies are negatively correlated with the loyalty price and poaching price of organic agricultural products, but that they will not affect the difference between the two types of prices. When the inherited market of organic agricultural products is dominant, the size of green subsidy affects the relationship between the prices of the two types of products. However, when organic agricultural products do not dominate the initial market, green subsidies do not affect the size of the relationship between the two prices of the two types of products. When the initial market position of organic agricultural products is different, the types of competing customers are different between the two types of enterprises, and the intensity of competition will increase with the increase of subsidies. Green subsidies increase the profits of organic agricultural enterprises and reduce the profits of conventional agricultural enterprises